Solving the multi-modal transportation problem <i>via</i> the rough interval approach
نویسندگان
چکیده
This research studies a transportation problem to minimize total cost under the rough interval approximation by considering multi-modal transport framework, referred here as Multi-Modal Transportation Problem (MMTP). The parameters of MMTP are intervals, because is chosen from real-life scenario. To solve environment, we employ chance-constrained programming and expected value operator for then outline main advantages our suggested method over those existing methods. Next, propose an algorithm optimally present numerical example examine proposed technique. Finally, solution analyzed with rough-chance constrained operator.
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولSolving the Fixed Charge Transportation Problem by New Heuristic Approach
The fixed charge transportation problem (FCTP) is a deployment of the classical transportation problem in which a fixed cost is incurred, independent of the amount transported, along with a variable cost that is proportional to the amount shipped. Since the problem is considered as an NP-hard, the computational time grows exponentially as the size of the problem increases. In this pape...
متن کاملA New Approach for Solving Interval Quadratic Programming Problem
This paper discusses an Interval Quadratic Programming (IQP) problem, where the constraints coefficients and the right-hand sides are represented by interval data. First, the focus is on a common method for solving Interval Linear Programming problem. Then the idea is extended to the IQP problem. Based on this method each IQP problem is reduced to two classical Quadratic Programming (QP) proble...
متن کاملProviding a Method for Solving Interval Linear Multi-Objective Problems Based on the Goal Programming Approach
Most research has focused on multi-objective issues in its definitive form, with decision-making coefficients and variables assumed to be objective and constraint functions. In fact, due to inaccurate and ambiguous information, it is difficult to accurately identify the values of the coefficients and variables. Interval arithmetic is appropriate for describing and solving uncertainty and inaccu...
متن کاملSolving Multi-Objective Fuzzy Solid Transportation Problem Based On Expected Value And The Goal Programming Approach
In the present paper, the multi-objective solid transportation problem with fuzzy coefficients for the objectives and constraints is modelled and then solved. Fuzzy goal programming is used to the linear multiobjective solid transportation problem, and an optimal compromise solution is obtained. Firstly, expected values of the fuzzy objective functions are considered to derive crisp values. In ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rairo-operations Research
سال: 2022
ISSN: ['1290-3868', '0399-0559']
DOI: https://doi.org/10.1051/ro/2022131